Recompression techniques for adaptive cross approximation

The adaptive cross approximation method generates low-rank approximations to suitablem×n sub-blocks of discrete integral formulations of elliptic boundary value problems. A characteristic property is that the approximation, which requires k(m+n), k ∼ | log ε|∗, units of storage, is generated in an adaptive and purely algebraic manner using only few of the matrix entries. In this article we present further recompression techniques which bring the required amount of storage down to sublinear order kk′, where k′ depends logarithmically on the accuracy of the approximation but is independent of the matrix size.